AOTO: adaptive overlay topology optimization in unstructured P2P systems - Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
نویسندگان
چکیده
∗ This work was partially supported by Michigan State University IRGP Grant 41114 and by Hong Kong RGC Grant HKUST6161/03E. AbstractPeer-to-Peer (P2P) systems are self-organized and decentralized. However, the mechanism of a peer randomly joining and leaving a P2P network causes topology mismatching between the P2P logical overlay network and the physical underlying network. The topology mismatching problem brings great stress on the Internet infrastructure and seriously limits the performance gain from various search or routing techniques. We propose the Adaptive Overlay Topology Optimization (AOTO) technique, an algorithm of building an overlay multicast tree among each source node and its direct logical neighbors so as to alleviate the mismatching problem by choosing closer nodes as logical neighbors, while providing a larger query coverage range. AOTO is scalable and completely distributed in the sense that it does not require global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. The simulation shows that AOTO can effectively solve the mismatching problem and reduce more than 55% of the traffic generated by the P2P system itself.
منابع مشابه
AOTO: adaptive overlay topology optimization in unstructured P2P systems
Peer-to-Peer (P2P) systems are self-organized and decentralized. However, the mechanism of a peer randomly joining and leaving a P2P network causes topology mismatching between the P2P logical overlay network and the physical underlying network. The topology mismatching problem brings great stress on the Internet infrastructure and seriously limits the performance gain from various search or ro...
متن کاملOverlay Topology Matching in P2P Systems
The emerging peer-to-peer (P2P) model has gained significant attention due to its many unique features in supporting file sharing among a huge number of networked users. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a serious topology mismatching between the P2P overlay network and the physical underlying n...
متن کاملRate-one Space Frequency Block Codes with Maximum Diversity Gain for MIMO-OFDM - Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
We proposed a novel rate-1, space-frequency (SF) code for an Orthogonal Frequencey Division Multiplexing (OFDM) system with transmit (M ) and receive (N ) antennas that achieves the maximum diversity attainable over frequencyselective channels. Since the SF code symbol is transmitted in one OFDM block duration, it has smaller processing delay than previously proposed Space-Time-Frequency (STF) ...
متن کاملPeer-to-Peer Keyword Search Using Keyword Relationship
Decentralized and unstructured peer-to-peer (P2P) networks such as Gnutella are attractive for Internet-scale information retrieval and search systems because they require neither any centralized directory nor any centralized management of overlay network topology and data placement. However, due to this decentralized architecture, current P2P keyword search systems lack useful global knowledge...
متن کاملMDLT: A Polynomial Time Optimal Algorithm for Maximization of Time-to-First-Failure in Energy Constrained Wireless Broadcast Networks - Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
We consider the problem of maximizing the timeto-first-failure, defined as the time till the first node in the network runs out of battery energy, in energy constrained broadcast wireless networks. We discuss a greedy algorithm and prove that it solves the problem optimally for a broadcast application, in polynomial time, provided the complete power matrix and the battery residual capacities ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001